Clausal Logic and Logic Programming in Coherent Domains
نویسندگان
چکیده
Synopsis. We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of a coherent algebraic dcpo. The robustness of this approach comes from the agreement bewteen the declarative semantics and the xed-point semantics, as well as the agreement between the xed-point semantics and the semantics of power default reasoning for consistent programs, both of which are established in this paper.
منابع مشابه
Clausal Logic and Logic Programming in Algebraic Domains
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...
متن کاملFormal Concept Analysis and Resolution in Algebraic Domains — Preliminary Report
We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution...
متن کاملFormal Concept Analysis and Resolution in Algebraic Domains
We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution...
متن کاملClausal Graph Tableaux for Hybrid Logic with Eventualities and Difference
We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. They provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no ...
متن کاملFirst-Order jk-Clausal Theories are PAC-Learnable
We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomialsample polynomial-time PAC-learnable with one-sided error from positive examples only. In our framework, concepts are clausal theories and ex...
متن کامل